/*List Merge( List L1, List L2 ){
	List L,A,B,p;
	L=(List)malloc(sizeof(struct Node));
	A=L1->Next;
	B=L2->Next;
	L->Next=NULL;
	p=L;
	while(A&&B){
		if(A->Data > B->Data){
			p->Next = B;
			B = B->Next;
			p = p->Next;
		}
		else{
			p->Next = A;
			A = A->Next;
			p = p->Next;
		}
	} 
	if(A)
		p->Next = A;
	if(B)
		p->Next = B;
	L1->Next=NULL;
	L2->Next=NULL;
	return L;
}
*/